Undecidable Theories of Lyndon Algebras

نویسندگان

  • Vera Stebletsova
  • Yde Venema
چکیده

With each projective geometry we can associate a Lyndon algebra. Such an algebra always satisfies Tarski’s axioms for relation algebras and Lyndon algebras thus form an interesting connection between the fields of projective geometry and algebraic logic. In this paper we prove that if G is a class of projective geometries which contains an infinite projective geometry of dimension at least three, then the class L(G) of Lyndon algebras associated with projective geometries in G has an undecidable equational theory. In our proof we develop and use a connection between projective geometries and diagonal-free cylindric algebras.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Undecidable Relativizations of Algebras of Relations

In this paper we show that relativized versions of relation set algebras and cylindric set algebras have undecidable equational theories if we include coordinatewise versions of the counting operations into the similarity type. We apply these results to the guarded fragment of first-order logic. ?

متن کامل

Decision Problems for Equational Theories of Relation Algebras

The foundation of an algebraic theory of binary relations was laid by C. S. Peirce, building on earlier work of Boole and De Morgan. The basic universe of discourse of this theory is a collection of binary relations over some set, and the basic operations on these relations are those of forming unions, complements, relative products (i.e., compositions), and converses (i.e., inverses). There is...

متن کامل

Weakly associative relation algebras with projections

Built on the foundations laid by Peirce, Schröder and others in the 19th century, the modern development of relation algebras started with the work of Tarski and his colleagues [21, 22]. They showed that relation algebras can capture strong rst-order theories like ZFC, and so their equational theory is undecidable. The less expressive classWA of weakly associative relation algebras were introd...

متن کامل

Introductory Course on Relation Algebras, Finite-dimensional Cylindric Algebras, and Their Interconnections

These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections, delivered at the Conference on Alge-Relation algebras (RA's) are closely linked to cylindric algebras (CA's) and polyadic equality algebras (PEA's), and yet in certain ways they are quite diierent. The links and diierences allow for constructive interaction between these sub...

متن کامل

Decidability of Relation Algebras with Weakened Associativity

Tarski showed that mathematics can be built up in the equational theory EqRA of relation algebras (RA's), hence EqRA is undecidable. He raised the problem "how much associativity of relation composition is needed for this result." Maddux defined the classes NA 3 WA "J SA D RA by gradually weakening the associativity of relation composition, and he proved that the equational theory of SA is stil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 66  شماره 

صفحات  -

تاریخ انتشار 2001